An overview on skew constacyclic codes and their subclass of LCD codes
نویسندگان
چکیده
<p style='text-indent:20px;'>This paper is about a first characterization of LCD skew constacyclic codes and some constructions cyclic negacyclic over <inline-formula><tex-math id="M1">\begin{document}$ \mathbb{F}_{p^2} $\end{document}</tex-math></inline-formula>.</p>
منابع مشابه
Skew constacyclic codes over Galois rings
We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...
متن کاملSkew constacyclic codes over finite chain rings
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of x − λ, where λ is a unit element, are exhibited. When λ = 1, the generators of Euclidean and Hermitian dual codes of such codes are determined tog...
متن کاملA circulant approach to skew-constacyclic codes
We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x; θ] modulo the left ideal generated by a polynomial of the type x − a. This allows us to develop an approach to skew-constacyclic codes based on such circulants. Properties of these circulants are derived, and in particular it is shown that the transpose of a certain circulant is a circulant again. This rec...
متن کاملA note on the duals of skew constacyclic codes
Let Fq be a finite field with q elements and denote by θ : Fq → Fq an automorphism of Fq. In this note, we deal with skew constacyclic codes, i.e. linear codes of Fnq which are invariant under the action of a semi-linear map T : Fnq → F n q , defined by T (a0, ..., an−2, an−1) := (αan−1, a0, ..., an−2) for some α ∈ Fq −{0} and n ≥ 2. In particular, we study some algebraic and geometric properti...
متن کاملOn optimal constacyclic codes
In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters. In this light, we propose constructions of families of classical block and convolutional maximum-distance-separable (MDS) constacyclic codes, as we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2021
ISSN: ['1930-5346', '1930-5338']
DOI: https://doi.org/10.3934/amc.2020085